Enhanced core stateless fair queuing with multiple queue priority scheduler

نویسندگان

  • Sivasubramaniam Nandhini
  • Senniappan Palaniammal
چکیده

The Core Stateless Fair Queuing (CSFQ) is a distributed approach of Fair Queuing (FQ). The limitations include its inability to estimate fairness during large traffic flows, which are short and bursty (VoIP or video), and also it utilizes the single FIFO queue at the core router. For improving the fairness and efficiency, we propose an Enhanced Core Stateless Fair Queuing (ECSFQ) with multiple queue priority scheduler. Initially priority scheduler is applied to the flows entering the ingress edge router. If it is real time flow i.e., VoIP or video flow, then the packets are given higher priority else lower priority. In core router, for higher priority flows the Multiple Queue Fair Queuing (MQFQ) is applied that allows a flow to utilize multiple queues to transmit the packets. In case of lower priority, the normal max-min fairness criterion of CSFQ is applied to perform probabilistic packet dropping. By simulation results, we show that this technique improves the throughput of real time flows by reducing the packet loss and delay.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive CSFQ: A New Fair Queuing Mechanism for SCORE Networks

In stateless core (SCORE) networks, edge routers maintain per-flow state while core routers do not. Core stateless fair queuing (CSFQ) has been proposed for approximating the operation of per-flow queuing techniques in SCORE networks. However, the packet dropping probability offered by CSFQ suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation for TCP flows. This paper propo...

متن کامل

Implementation of the Multiclass Priority Fair Queuing ( MPFQ )

This paper presents the implementation of a wireless scheduling algorithm that provides backbone Quality of Service (QoS) support to mobile stations. The algorithm described in this paper maps all existing ATM traac types into priorities and weights for a Multiclass Priority Fair Queue (MPFQ) scheduler. The MPFQ scheduler is designed to operate in a wireless base station. A prototype driver has...

متن کامل

Implementation of the Multiclass Priority Fair Queuing (MPFQ) Algorithm for Extending Quality of Service in Existing Backbones to Wireless Endpoints

This paper presents the implementation of a wireless scheduling algorithm that provides backbone Quality of Service (QoS) support to mobile stations. The algorithm described in this paper maps all existing ATM tra c types into priorities and weights for a Multiclass Priority Fair Queue (MPFQ) scheduler. The MPFQ scheduler is designed to operate in a wireless base station. A prototype driver has...

متن کامل

Queue Length Based Fair Queueing in Core - Stateless Networks 1

In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is...

متن کامل

Scheduling Time-Sensitive IP Traffic

This article presents an hybrid priority queuing model based scheduler for real-time traffic differentiation. The proposed scheduler is designed as a mechanism to provide queuing delay differentiation among real-time traffic classes. The novel characteristic of the presented scheduler is the capability to simultaneously try to achieve an upper time limit for queuing delays and, under heavy load...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. Arab J. Inf. Technol.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2014